#include<iostream>
using namespace std;
using ll = long long;
const int N = 2010, MOD = 100003;
ll fact[N], infact[N];
int a, b, c, d, k;
ll qmi(ll a, ll k, ll p)
{
    ll res = 1;
    while (k)
    {
        if (k & 1) res = res * a % p;
        a = a * a % p;
        k >>= 1;
    }
    return res;
}
ll C(ll a, ll b)
{
    if (a < b) return 0;
    return fact[a] * infact[a - b] % MOD * infact[b] % MOD;
}
ll P(ll a, ll b)
{
    if (a < b) return 0;
    return fact[a] * infact[a - b] % MOD;
}
int main()
{
    fact[0] = infact[0] = 1;
    for (int i = 1; i < N; i++)
    {
        fact[i] = fact[i - 1] * i % MOD;
        infact[i] = infact[i - 1] * qmi(i, MOD - 2, MOD) % MOD;
    }
    cin >> a >> b >> c >> d >> k;
    ll res = 0;
    for (int i = 0; i <= k; i++)
    {
        res = (res + C(b, i) * P(a, i) % MOD * C(d, k - i) % MOD * P(a + c - i, k - i) % MOD) % MOD;
    }
    cout << res << endl;
    return 0;
}
